Planning in probabilistic domains using a deterministic numeric planner

نویسندگان

  • Sergio Jiménez
  • Andrew Coles
  • Amanda Smith
چکیده

In the probabilistic track of the IPC5 —the last International Planning Competitions— a probabilistic planner based on combining deterministic planning with replanning —FF-REPLAN—outperformed the other competitors. This probabilistic planning paradigm discarded the probabilistic information of the domain, just considering for each action its nominal effect as a deterministic effect. Thus, in certain domains, the plans proposed by this approach are not robust, so replanning occurs too much frequently. This paper describes a new approach to solve probabilistic planning problems, also based on deterministic planning and replanning; but without rejecting the probabilistic information of the domain. In this approach, the probabilistic domain is compiled into a new deterministic domain and the probabilistic information is translated to an action ‘cost model’, used by a numeric planner to improve the robustness of the plans found, reducing the frequency with which replanning occurs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probapop: Probabilistic Partial-Order Planning

We describe Probapop, a partial-order probabilistic planning system. Probapop is a blind (conformant) planner that finds plans for domains involving probabilistic actions but no observability. The Probapop implementation is based on Vhpop, a partial-order deterministic planner written in C++. The Probapop algorithm uses plan graph based heuristics for selecting a plan from the search queue, and...

متن کامل

Hybrid Motion Planning Using Minkowski Sums

Probabilistic and deterministic planners are two major approximate-based frameworks for solving motion planning problems. Both approaches have their own advantages and disadvantages. In this work, we provide an investigation to the following question: Is there a planner that can take the advantages from both probabilistic and deterministic planners? Our strategy to achieve this goal is to use t...

متن کامل

MAXPLAN: A New Approach to Probabilistic Planning

Classical arti cial intelligence planning techniques can operate in large domains but traditionally assume a deterministic universe. Operations research planning techniques can operate in probabilistic domains but break when the domains approach realistic sizes. maxplan is a new probabilistic planning technique that aims at combining the best of these two worlds. maxplan converts a planning ins...

متن کامل

Temporal Planning in Domains with Linear Processes

We consider the problem of planning in domains with continuous linear numeric change. Such change cannot always be adequately modelled by discretisation and is a key facet of many interesting problems. We show how a forward-chaining temporal planner can be extended to reason with actions with continuous linear effects. We extend a temporal planner to handle numeric values using linear programmi...

متن کامل

Probabilistic Planning via Determinization in Hindsight

This paper investigates hindsight optimization as an approach for leveraging the significant advances in deterministic planning for action selection in probabilistic domains. Hindsight optimization is an online technique that evaluates the onestep-reachable states by sampling future outcomes to generate multiple non-stationary deterministic planning problems which can then be solved using searc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006